package comviva.coll;

///////////////////////////////////////////////////////////////////////////////
//Copyright (c) 2002, Eric D. Friedman All Rights Reserved.
//
//This library is free software; you can redistribute it and/or
//modify it under the terms of the GNU Lesser General Public
//License as published by the Free Software Foundation; either
//version 2.1 of the License, or (at your option) any later version.
//
//This library is distributed in the hope that it will be useful,
//but WITHOUT ANY WARRANTY; without even the implied warranty of
//MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//GNU General Public License for more details.
//
//You should have received a copy of the GNU Lesser General Public
//License along with this program; if not, write to the Free Software
//Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
///////////////////////////////////////////////////////////////////////////////

import java.io.Serializable;

//////////////////////////////////////////////////
//THIS IS A GENERATED CLASS. DO NOT HAND EDIT! //
//////////////////////////////////////////////////

/**
 * Interface to support pluggable hashing strategies in maps and sets.
 * Implementors can use this interface to make the trove hashing algorithms use
 * an optimal strategy when computing hashcodes.
 * 
 * Created: Sun Nov 4 08:56:06 2001
 * 
 * @author Eric D. Friedman
 * @version $Id: PHashingStrategy.template,v 1.1 2006/11/10 23:28:00 robeden Exp
 *          $
 */

public interface TIntHashingStrategy extends Serializable {
	/**
	 * Computes a hash code for the specified int. Implementors can use the
	 * int's own value or a custom scheme designed to minimize collisions for a
	 * known set of input.
	 * 
	 * @param val
	 *            int for which the hashcode is to be computed
	 * @return the hashCode
	 */
	public int computeHashCode(int val);
} // TIntHashingStrategy
